Randomly distributed embedding making short-term high-dimensional data predictable
نویسندگان
چکیده
منابع مشابه
Fast Binary Embedding for High-Dimensional Data
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To address this problem, we propose two solutions which improve over existing approaches. The first method, Bilinear Binary Embedding (BBE), converts highdimensional ...
متن کاملMECHANICAL CHARACTERIZATION AND ANALYSIS OF RANDOMLY DISTRIBUTED SHORT BANANA FIBER REINFORCED EPOXY COMPOSITES
Short banana fiber reinforced composites have been prepared in laboratory to determine mechanical properties. It has been observed that as soon as the percentage of the banana fiber increases slightly there is a tremendous increase in ultimate tensile strength, % of strain and young modulus of elasticity. Reinforcement of banana fibers in epoxy resin increases stiffness and decreases damping pr...
متن کاملApproximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper, we present a general approach for extracting knowledge out of distributed data sets without transmitting all data from the local clients to a server site. In order to keep the transmission cost low, we first determin...
متن کاملHessian eigenmaps: locally linear embedding techniques for high-dimensional data.
We describe a method for recovering the underlying parametrization of scattered data (m(i)) lying on a manifold M embedded in high-dimensional Euclidean space. The method, Hessian-based locally linear embedding, derives from a conceptual framework of local isometry in which the manifold M, viewed as a Riemannian submanifold of the ambient Euclidean Space R(n), is locally isometric to an open, c...
متن کاملRobust Hessian Locally Linear Embedding Techniques for High-Dimensional Data
Recently manifold learning has received extensive interest in the community of pattern recognition. Despite their appealing properties, most manifold learning algorithms are not robust in practical applications. In this paper, we address this problem in the context of the Hessian locally linear embedding (HLLE) algorithm and propose a more robust method, called RHLLE, which aims to be robust ag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2018
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1802987115